Computer Arithmetic: Logic, Calculation, and Rewriting
نویسندگان
چکیده
Computer arithmetic is the logical theory which formalizes the way computers manipulate integer numbers. In this paper, we describe a combined system whose components are a logical theory for the Isabelle theorem prover, a calculational engine based on rewriting techniques, and a decision procedure for an extension of quantiier-free Presburger arithmetic. The goal of this work is to provide a general and eecient tool to help proving theorems in computer arithmetic. This contribution shows how it is possible to combine diierent formal techniques (deductive systems, rewriting techniques, decision procedures) in order to solve a notoriously hard problem.
منابع مشابه
Arithmetic Bit-Level Verification Using Network Flow Model
The paper presents a new approach to functional, bit-level verification of arithmetic circuits. The circuit is modeled as a network of adders and basic Boolean gates, and the computation performed by the circuit is viewed as a flow of binary data through such a network. The verification problem is cast as a Network Flow problem and solved using symbolic term rewriting and simple algebraic techn...
متن کاملReport from Dagstuhl Seminar 16031 Well Quasi - Orders in Computer Science
This report documents the program and the outcomes of Dagstuhl Seminar 16031 “Well QuasiOrders in Computer Science”, the first seminar devoted to the multiple and deep interactions between the theory of Well quasi-orders (known as the Wqo-Theory) and several fields of Computer Science (Verification and Termination of Infinite-State Systems, Automata and Formal Languages, Term Rewriting and Proo...
متن کاملLEC: Learning Driven Data-path Equivalence Checking
In the LEC system, we employ a learning-driven approach for solving combinational data-path equivalence checking problems. The data-path logic is specified using Boolean and word-level operators in VHDL/Verilog. The targeted application area are Cto-RTL equivalence checking problems found in an industrial setting. These are difficult because of the algebraic transformations done on the data-pat...
متن کاملDesign and Simulation of a 2GHz, 64×64 bit Arithmetic Logic Unit in 130nm CMOS Technology
The purpose of this paper is to design a 64×64 bit low power, low delay and high speed Arithmetic Logic Unit (ALU). Arithmetic Logic Unit performs arithmetic operation like addition, multiplication. Adders play important role in ALU. For designing adder, the combination of carry lookahead adder and carry select adder, also add-one circuit have been used to achieve high speed and low area. In mu...
متن کاملEfficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Deduction modulo is a paradigm which consists in applying the inference rules of a deductive system—such as for instance natural deduction—modulo a rewrite system over terms and propositions. It has been shown that higher-order logic can be simulated into the first-order natural deduction modulo. However, a theorem stated by Gödel and proved by Parikh expresses that proofs in second-order arith...
متن کامل